On the Speedup of Distributed Linear Solvers
نویسندگان
چکیده
Many distributed applications repeatedly perform the same sequence of operations creating a cyclic pattern of behavior. This pattern can be used to model the steady–state behavior of the application, and to predict its performance. In particular, the relationship between the execution time, or the speedup, and the number of processors is studied for distributed iterative solution of (large) systems of sparse linear equations. Typical definition of the speedup, S(N), where N if the number of processors, is [5]:
منابع مشابه
Performance Analysis of Distributed Iterative Linear Solvers
The solution of large, sparse systems of linear equations is an inherent part of many computational methods in science and engineering. For such systems, iterative methods are often more attractive than direct methods because of their small (and constant) memory requirements. Also, the performance of iterative solvers can easily be improved by using distributed systems. A common performance cha...
متن کاملA Parallelizable Acceleration Framework for Packing Linear Programs
This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n. The framework can be used as a black box to speed up linear programming solvers dramatically, by two orders of magnitude in our experiments. We present worst-case guarantees on ...
متن کاملNon-stationary iterative solvers on a PC cluster
In this study, we introduce cost effective strategies and algorithms for parallelizing the Krylov subspace based non-stationary iterative solvers such as Bi-CGM and Bi-CGSTAB for distributed computing on a cluster of PCs using ANULIB message passing libraries. We investigate the effectiveness of the parallel solvers on the linear systems resulting in numerical solution of some 2D and 3D nonline...
متن کاملApplication of the Finite Volume Method and Unstructured Meshes to Linear Elasticity
A recent emergence of the Finite Volume Method (FVM) in structural analysis promises a viable alternative to the well-established Finite Element solvers. In this paper the linear stress analysis problem is discretised using the practices usually associated with FVM in uid ows. These include the second-order accurate discreti-sation on Control Volumes of arbitrary polyhedral shape; segregated so...
متن کاملParallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. Here we show that SpGEMM also yields efficient algorithms for general sparse-matrix indexing in distributed memory, provided that the underlying SpGEMM implementation is sufficiently flexible and scalable. We d...
متن کامل